منابع مشابه
A Programming and Problem Solving Seminar
This report contains transcripts of the classroom discussions of Stanford's Computer Science problem solving course for Ph.D. students, CS304, during Winter quarter 1990, and the first CS204 class for undergraduates, in the Spring of 1990. The problems, and the solutions offered by the classes, span a large range of ideas in computer science. Since they constitute a study both of programming an...
متن کاملDistributed Systems seminar: Shortest-path problem continuation
In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum of the weights of its edges is minimized. In last semester's report "Distributed Systems seminar: Shortest-path problem[1]" the previously created program was introduced that was able to perform shortest path search using A* algorithm on OpenStreetmap data. There were ma...
متن کاملData Reduction and Problem Kernels (Dagstuhl Seminar 12241)
Future Internet for eHealth (Dagstuhl Seminar 12231) Katarzyna Wac, David Hausheer, Markus Fiedler, and Paolo Bonato . . . . . . . . . . . . . 1 Data Reduction and Problem Kernels (Dagstuhl Seminar 12241) Michael R. Fellows, Jiong Guo, Dániel Marx, and Saket Saurabh . . . . . . . . . . . . . . . . 26 Putting Data on the Map (Dagstuhl Seminar 12261) Stephen Kobourov, Alexander Wolff, and Frank v...
متن کاملSolving the Nurse Rostering Problem Knowledge Representation and Reasoning Seminar
Nurse rostering is a complex problem which affects the everyday activities and health care tasks in modern hospitals. The Nurse Rostering Problem is a subclass of the personnel scheduling problems, and most of its instances are NP-hard. The goal is to find a quality assignment of shift categories to available nurses. Even though solving the Nurse Rostering Problem has been a field of interest o...
متن کاملTight Approximation Bounds for the Seminar Assignment Problem
The seminar assignment problem is a variant of the generalized assignment problem in which items have unit size and the amount of space allowed in each bin is restricted to an arbitrary set of values. The problem has been shown to be NP-complete and to not admit a PTAS. However, the only constant factor approximation algorithm known to date is randomized and it is not guaranteed to always produ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1983
ISSN: 0001-8708
DOI: 10.1016/0001-8708(83)90039-7